Rankers over Infinite Words

نویسندگان

  • Luc Dartois
  • Manfred Kufleitner
  • Alexander Lauser
چکیده

We consider the fragments FO, Σ2 ∩ FO, Π2 ∩ FO, and ∆2 of first-order logic FO[<] over finite and infinite words. For all four fragments, we give characterizations in terms of rankers. In particular, we generalize the notion of a ranker to infinite words in two possible ways. Both extensions are natural in the sense that over finite words, they coincide with classical rankers and over infinite words, they both have the full expressive power of FO. Moreover, the first extension of rankers admits a characterization of Σ2 ∩ FO while the other leads to a characterization of Π2 ∩ FO. Both versions of rankers yield characterizations of the fragment ∆2 = Σ2 ∩ Π2. As a byproduct, we also obtain characterizations based on unambiguous temporal logic and unambiguous interval temporal logic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The FO2 alternation hierarchy is decidable

We consider the two-variable fragment FO[<] of first-order logic over finite words. Numerous characterizations of this class are known. Thérien and Wilke have shown that it is decidable whether a given regular language is definable in FO[<]. From a practical point of view, as shown by Weis, FO[<] is interesting since its satisfiability problem is in NP. Restricting the number of quantifier alte...

متن کامل

Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm

The Complexity of Regular(-Like) Expressions p. 16 On Decision Problems for Simple and Parameterized Machines p. 31 DNA Computing and Its Implications for Theoretical Computer Science p. 32 Numeration Systems: A Link between Number Theory and Formal Language Theory p. 33 Regular Papers Algorithmic Properties of Millstream Systems p. 54 On a Conjecture by Carpi and D'Alessandro p. 66 Linking Alg...

متن کامل

Cost-Effective Combination of Multiple Rankers: Learning When Not To Query

Combining multiple rankers has potential for improving the performance over using any of the single rankers. However, querying multiple rankers for every search request can often be too costly due to efficiency or commercial reasons. In this work, we propose a more cost-effective approach that predicts the utility of any additional rankers, prior to querying them. We develop a combined measure ...

متن کامل

Lambda Words: A Class of Rich Words Defined Over an Infinite Alphabet

Lambda words are sequences obtained by encoding the differences between ordered elements of the form i + jθ, where i and j are non-negative integers and 1 < θ < 2. Lambda words are right-infinite words defined over an infinite alphabet that have connections with Sturmian words, Christoffel words, and interspersion arrays. We show that Lambda words are infinite rich words. Furthermore, any Lambd...

متن کامل

First-order Fragments with Successor over Infinite Words

We consider fragments of first-order logic and as models we allow finite and infinite words simultaneously. The only binary relations apart from equality are order comparison < and the successor predicate +1. We give characterizations of the fragments Σ2 = Σ2[<,+1] and FO2 = FO2[<,+1] in terms of algebraic and topological properties. To this end we introduce the factor topology over infinite wo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1005.0505  شماره 

صفحات  -

تاریخ انتشار 2010